Efficient Stagnation Avoidance for Manets with Local Repair Strategy Using Ant Colony Optimization

نویسنده

  • M Rangaswamy
چکیده

Wireless networks such as Mobile AdHoc Networks (MANETs) have many advantages compared to wired networks. In MANETs the communication is not limited to a certain geometrical region. Swarm Intelligence based ACO algorithms provide interesting solutions to network routing problems. ACO based routing in MANETs will enhance the reliability and efficient packet delivery. They help in reducing control overhead due to their inherent scalable feature. The similarity between ant and nodes, colony and Wireless network helps to use ACO based routing in MANETs. The Termite Algorithms contains several tunable parameters and methods to automate the selection of optimal routes for different network conditions. However, Termite doesn’t contain methods for determination of QoS, Route Maintenance; Load balancing etc. The present work focuses on development of an efficient routing algorithm “Modified Termite algorithms” (MTA) for MANETs. The MTA developed by adopting efficient pheromone evaporation technique will address to load balancing problems. By including QoS, efficient route maintenance, local repair strategy by prediction of node failures, the MTA is expected to enhance the performance of the network in terms of throughput, and reduction of End-to-end delay and routing overheads. The results of the analysis are presented in the paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant Colony Optimization Based Modified Termite Algorithm (mta) with Efficient Stagnation Avoidance Strategy for Manets

Designing an effective load balancing algorithm is difficult due to Dynamic topology of MANET. To address the problem, a load balancing routing algorithm namely Modified Termite Algorithm (MTA) has been developed based on ant’s food foraging behavior. Stability of the link is determined based on node stability factor ‘∆’. The stability factor “∆ “of the node is the ratio defined between the “he...

متن کامل

Parallelized ACO based Routing for Stagnation Mitigation and Avoidance of Multimedia Traffic Over MANETs

Ant Colony Optimization (ACO) (Deepalakshmi & Radhakrishnan, 2009; Sharma & Kotecha, 2011; Sharma, Karkhanawala, & Kotecha, 2011) is a meta-heuristic, suitable for optimized solutions to routing problem in Mobile Adhoc Networks (MANETs). ACO based algorithms are fully distributed, self-organizing, fault tolerant, and intrinsically adapts to changing traffic patterns. However, if the best path i...

متن کامل

Optimized Ant Colony Algorithm by Local Pheromone Update

Ant colony algorithm, a heuristic simulated algorithm, provides better solutions for non-convex, non-linear and discontinuous optimization problems. For ant colony algorithm, it is frequently to be trapped into local optimum, which might lead to stagnation. This article presents the city-select strategy, local pheromone update strategy, optimum solution prediction strategy and local optimizatio...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Suitability of Ant Colony Optimization as an Application to MANET

Mobile ad-hoc networks (MANETs) are infrastructure-less networks consisting of wireless devices called as mobile nodes which are organized in autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenge in MANETs. Ant colony optimization (ACO) is a population based meta-heuristic for combinatorial optimization proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012